NOtIONS cENtrAL tO GrANULAtION OF KNOWLEDGE

نویسنده

  • Lech Polkowski
چکیده

Granular computing, initiated by Lotfi A. Zadeh, has acquired wide popularity as a tool for approximate reasoning, fusion of knowledge, cognitive computing. The need for formal methods of granulation, and means for computing with granules, has been addressed in this work by applying methods of rough mereology. Rough mereology is an extension of mereology taking as the primitive notion the notion of a part to a degree. Granules are formed as classes of objects which are a part to a given degree of a given object. In addition to an exposition of this mechanism of granulation, we point also to some applications like granular logics for approximate reasoning and classifiers built from granulated data sets

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Foundations and Applications of the Paradigm of Granular Rough Computing

Granular computing, initiated by Lotfi A. Zadeh, has acquired wide popularity as a tool for approximate reasoning, fusion of knowledge, cognitive computing. The need for formal methods of granulation, and means for computing with granules, has been addressed in this work by applying methods of rough mereology. Rough mereology is an extension of mereology taking as the primitive notion the notio...

متن کامل

On Approximate Equivalences of Multigranular Rough Sets and Approximate Reasoning

The notion of rough sets introduced by Pawlak has been a successful model to capture impreciseness in data and has numerous applications. Since then it has been extended in several ways. The basic rough set introduced by Pawlak is a single granulation model from the granular computing point of view. Recently, this has been extended to two types of multigranular rough set models. Pawlak and Novo...

متن کامل

Granular Mereotopology: A First Sketch

Mereotopology aims at a reconstruction of notions of set topology in mereological universa. Because of foundational differences between set theory and mereology, most notably, the absence of points in the latter, the rendering of notions of topology in mereology faces serious difficulties. On the other hand, some of those notions, e.g., the notion of a boundary, belong in the canon of the most ...

متن کامل

Uncertainty analysis of hierarchical granular structures for multi-granulation typical hesitant fuzzy approximation space

Hierarchical structures and uncertainty measures are two main aspects in granular computing, approximate reasoning and cognitive process. Typical hesitant fuzzy sets, as a prime extension of fuzzy sets, are more flexible to reflect the hesitance and ambiguity in knowledge representation and decision making. In this paper, we mainly investigate the hierarchical structures and uncertainty measure...

متن کامل

Solved and unsolved problems in generalized notions of Connes amenability

We survey the recent investigations on (bounded, sequential) approximate Connes amenability and pseudo-Connes amenability for dual Banach algebras. We will discuss the core problems concerning these notions and address the signicance of any solutions to them to the development of the eld.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015